Fractional Coloring of Triangle-Free Planar Graphs
نویسندگان
چکیده
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3− 1 n+1/3 .
منابع مشابه
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
Given a triangle-free planar graph G and a 9-cycle C in G, we characterize situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results when C is a cycle of length at most 8. Disciplines Mathematics Comments Choi, Ilkyoo, Jan Ekstein, Přemysl Holub, and Bernard Lidický. "3-coloring triangle-free planar graphs with a precolored 9-cycle." 68 Europe...
متن کاملSubcubic triangle-free graphs have fractional chromatic number at most 14/5
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233 (2001), 233–237].
متن کاملA note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs
The precoloring extension coloring problem consists in deciding, given a positive integer k, a graph G = (V,E) and k pairwise disjoint subsets V0, . . . , Vk−1 of V , if there exists a (vertex) coloring S = (S0, . . . , Sk−1) of G such that Vi ⊆ Si, for all i = 0, . . . , k − 1. In this note, we show that the precoloring extension coloring problem is NP-complete in triangle free planar graphs w...
متن کاملAcyclic chromatic index of triangle-free 1-planar graphs
An acyclic edge coloring of a graph G is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index χa(G) of a graph G is the least number of colors in an acyclic edge coloring of G. It was conjectured that χa(G) ≤ ∆(G) + 2 for any simple graph G with maximum degree ∆(G). A graph is 1-planar if it can be drawn on the plane such that every edg...
متن کاملEdge Coloring of Triangle-Free 1-Planar Graphs
it is shown that each triangle-free 1-planar graph with maximum degree $\Delta\geq7$ can be $\Delta$-colorable by Discharging Method.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015